Multi-robot adversarial patrolling: Handling sequential attacks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-robot adversarial patrolling: facing coordinated attacks

The use of robot teams is common for performing patrol tasks, in which the robots are required to repeatedly visit a target area (perimeter, in our case) controlled by an adversary, in order to detect penetrations. Previous work has focused on determining the optimal patrol algorithm when facing a general adversary that tries to penetrate once through the patrol path. There, the robots’ goal is...

متن کامل

Distributed Multi-Robot Area Patrolling in Adversarial Environments

Multi-robot patrolling is the problem of repeatedly visiting a group of regions of interest in an environment with a group of robots to prevent intrusion. Early works proposed deterministic patrolling algorithms which could be learned by an adversary observing them over time. More recent works provide non-deterministic patrolling schemes, but these are limited to perimeter patrolling and requir...

متن کامل

Multi-Robot Adversarial Patrolling: Facing a Full-Knowledge Opponent

The problem of adversarial multi-robot patrol has gained interest in recent years, mainly due to its immediate relevance to various security applications. In this problem, robots are required to repeatedly visit a target area in a way that maximizes their chances of detecting an adversary trying to penetrate through the patrol path. When facing a strong adversary that knows the patrol strategy ...

متن کامل

Decentralized and Nondeterministic Multi-Robot Area Patrolling in Adversarial

Multi-robot patrolling is the problem of repeatedly visiting a group of regions of interest in an environment with a group of robots to prevent intrusion. Early works have proposed deterministic patrolling algorithms which could be learned by an adversary observing them over time. More recent works provide non-deterministic patrolling schemes which only work for perimeter patrolling and require...

متن کامل

Decentralized and Nondeterministic Multi-Robot Area Patrolling in Adversarial Environments

Multi-robot patrolling is the problem of repeatedly visiting a group of regions of interest in an environment with a group of robots to prevent intrusion. Early works have proposed deterministic patrolling algorithms which could be learned by an adversary observing them over time. More recent works provide non-deterministic patrolling schemes which only work for perimeter patrolling and require...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 2019

ISSN: 0004-3702

DOI: 10.1016/j.artint.2019.02.004